On real factors of real interval polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real Roots of Quadratic Interval Polynomials

The aim of this paper is to study the roots of interval polynomials. The characterization of such roots is given and an algorithm is developed for computing the interval roots of quadratic polynomials with interval coefficients. Mathematics Subject Classification: 65G40

متن کامل

On Coefficient Diameters of Real Schur-stable Interval Polynomials

A new necessary, sharp condition for Schur-stability of real interval polynomials is established here. Moreover, a way to study perturbation effects on the coefficient range is outlined. The results may be used in a preprocessing rejection scheme when testing for robust Schur-stability.

متن کامل

Root refinement for real polynomials using quadratic interval refinement

We consider the problem of approximating all real roots of a square-free polynomial f with real coefficients. Given isolating intervals for the real roots and an arbitrary positive integer L, the task is to approximate each root to L bits after the binary point. Abbott has proposed the quadratic interval refinement method (QIR for short), which is a variant of Regula Falsi combining the secant ...

متن کامل

Polynomials with All Zeros Real and in a Prescribed Interval

We provide a characterization of the real-valued univariate polynomials that have only real zeros, all in a prescribed interval [a, b]. The conditions are stated in terms of positive semidefiniteness of related Hankel matrices.

متن کامل

Computing real roots of real polynomials

Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for approximating all complex roots, the best algorithm known is based on an almost optimal method for approximate polynomial factorization, introduced by Pan in 2002....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2009

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2008.04.014